On determinism versus nondeterminism for restarting automata

On determinism versus unambiquous nondeterminism for decision trees

On Regular Sets of Bounds and Determinism versus Nondeterminism

This paper illustrates the richness of the concept of regular sets of time bounds and demonstrates its application to problems of computational complexity. There is a universe of bounds whose regular subsets allow to represent several time complexity classes of common interest and are linearly ordered with respect to the confinality relation which implies the inclusion between the corresponding...

Determinism versus Nondeterminism with Arithmetic Tests and Computation

For each natural number d we consider a finite structure Md whose universe is the set of all 0, 1-sequence of length n = 2d, each representing a natural number in the set {0, 1, ..., 2n − 1} in binary form. The operations included in the structure are the constants 0, 1, 2n − 1, n, multiplication and addition modulo 2n, the unary function min{2x, 2n − 1}, the binary functions bx/yc, max(x, y), ...

On h-Lexicalized Restarting Automata

Following some previous studies on restarting automata, we introduce a refined model – the hlexicalized restarting automaton (h-RLWW). We argue that this model is useful for expressing lexicalized syntax in computational linguistics. We compare the input languages, which are the languages traditionally considered in automata theory, to the so-called basic and h-proper languages, which are (impl...

Determinism, Nondeterminism, Alternation, and Counting

Toda proved a remarkable connection between the polynomial hierarchy and the counting classes. Tarui improved Toda’s result to show the connection to a weak form of counting and provided an elegant proof. This paper shows that a key step in Tarui’s proof can be done uniformly using the depth-first traversal and provides the algorithm that generalizes Toda’s result to arbitrary alternating Turin...